Vector Arithmetic in the Triangular Grid

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The number of triangular islands on a triangular grid

The aim of the present paper is to carry on the research of Czédli in determining the maximum number of rectangular islands on a rectangular grid. We estimate the maximum of the number of triangular islands on a triangular grid.

متن کامل

Edge-Bandwidth of the Triangular Grid

In 1995, Hochberg, McDiarmid, and Saks [4] proved that the vertex-bandwidth of the triangular grid Tn is precisely n+1; more recently Balogh, Mubayi, and Pluhár [1] posed the problem of determining the edge-bandwidth of Tn. We show that the edge-bandwidth of Tn is bounded above by 3n− 1 and below by 3n− o(n).

متن کامل

3 Concave Cocirculations in a Triangular Grid

Let G = (V (G), E(G)) be a planar digraph embedded in the plane in which all inner faces are equilateral triangles (with three edges in each), and let the union R of these faces forms a convex polygon. The question is: given a function σ on the boundary edges of G, does there exist a concave function f on R which is affinely linear within each bounded face and satisfies f(v)− f(u) = σ(e) for ea...

متن کامل

Derived fuzzy importance of attributes based on the weakest triangular norm-based fuzzy arithmetic and applications to the hotel services

The correlation between the performance of attributes and the overallsatisfaction such as they are perceived by the customers is often used tocalculate the importance of attributes in the crisp case. Recently, the methodwas extended, based on the standard Zadeh extension principle, to the fuzzycase, taking into account the specificity of the human thinking. Thedifficulties of calculation are im...

متن کامل

Complexity of the Hamiltonian Cycle Problem in Triangular Grid Graphs

A triangular grid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. We show that the problem Hamiltonian Cycle is NP-complete for triangular grid graphs, while a hamiltonian cycle in connected, locally connected triangular grid graph can be found in polynomial time. 2000 Mathematics Subject Classification: 05C38 (05C45, 68Q25).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Entropy

سال: 2021

ISSN: 1099-4300

DOI: 10.3390/e23030373